Transversals and Independence in Linear Hypergraphs with Maximum Degree Two
نویسندگان
چکیده
منابع مشابه
Transversals and Independence in Linear Hypergraphs with Maximum Degree Two
For k > 2, let H be a k-uniform hypergraph on n vertices and m edges. Let S be a set of vertices in a hypergraph H. The set S is a transversal if S intersects every edge of H, while the set S is strongly independent if no two vertices in S belong to a common edge. The transversal number, τ(H), of H is the minimum cardinality of a transversal in H, and the strong independence number of H, α(H), ...
متن کاملSmall transversals in hypergraphs
For each positive integer k, we consider the set A k of all ordered pairs [a, b] such that in every k-graph with n vertices and m edges some set of at most am + bn vertices meets all the edges. We show that each A k with k > 2 has infinitely many extreme points and conjecture that, for every positive e, it has only finitely many extreme points [a, b] with a _> e. With the extreme points ordered...
متن کاملTransversals in 4-Uniform Hypergraphs
Let H be a 4-uniform hypergraph on n vertices. The transversal number τ(H) of H is the minimum number of vertices that intersect every edge. The result in [J. Combin. Theory Ser. B 50 (1990), 129–133] by Lai and Chang implies that τ(H) 6 7n/18 when H is 3-regular. The main result in [Combinatorica 27 (2007), 473–487] by Thomassé and Yeo implies an improved bound of τ(H) 6 8n/21. We provide a fu...
متن کاملGirth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملOn Ramsey numbers of uniform hypergraphs with given maximum degree
For every > 0 and every positive integers Δ and r , there exists C = C( ,Δ, r) such that the Ramsey number, R(H,H) of any r-uniform hypergraph H with maximum degree at most Δ is at most C|V (H)|1+ . © 2006 Elsevier Inc. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2017
ISSN: 1077-8926
DOI: 10.37236/6160